ASYMPTOTIC ITERATION METHOD FOR SINGULAR POTENTIALS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic iteration method for eigenvalue problems

An asymptotic interation method for solving second-order homogeneous linear differential equations of the form y = λ0(x)y ′ + s0(x)y is introduced, where λ0(x) 6= 0 and s0(x) are C∞ functions. Applications to Schrödinger type problems, including some with highly singular potentials, are presented. PACS 03.65.Ge Asymptotic iteration method for eigenvalue problems page 2

متن کامل

Application of variational iteration method for solving singular two point boundary value problem

DEA methodology allows DMUs to select the weights freely, so in the optimalsolution we may see many zeros in the optimal weight. to overcome this prob-lem, there are some methods, but they are not suitable for evaluating DMUswith fuzzy data. In this paper, we propose a new method for solving fuzzyDEA models with restricted multipliers with less computation, and comparethis method with Liu''''''...

متن کامل

Laplace Variational Iteration Method for Modified Fractional Derivatives with Non-singular Kernel

A universal approach by Laplace transform to the variational iteration method for fractional derivatives with the nonsingular kernel is presented; in particular, the Caputo-Fabrizio fractional derivative and the Atangana-Baleanu fractional derivative with the non-singular kernel is considered. The analysis elaborated for both non-singular kernel derivatives is shown the necessity of considering...

متن کامل

Application of variational iteration method for solving singular two point boundary value problems

In this paper, He's highly prolic variational iteration method is applied ef-fectively for showing the existence, uniqueness and solving a class of singularsecond order two point boundary value problems. The process of nding solu-tion involves generation of a sequence of appropriate and approximate iterativesolution function equally likely to converge to the exact solution of the givenproblem w...

متن کامل

General constraint preconditioning iteration method for singular saddle-point problems

For the singular saddle-point problems with nonsymmetric positive definite (1, 1) block, we present a general constraint preconditioning (GCP) iteration method based on a singular constraint preconditioner. Using the properties of the Moore-Penrose inverse, the convergence properties of the GCP iteration method are studied. In particular, for each of the two different choices of the (1, 1) bloc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Modern Physics A

سال: 2008

ISSN: 0217-751X,1793-656X

DOI: 10.1142/s0217751x08039852